Paramodulation-Based Theorem Proving
نویسندگان
چکیده
منابع مشابه
A Technique for Establishing Completeness Results in Theorem Proving with Equality
This is a summary of the methods and results of a longer paper of the same name which will appear elsewhere. The main result is that an automatic theorem proving system consisting of resolution, paramodulation, factoring, equality reversal, simplification and subsumption removal is complete in first-order logic with equality. When restricted to sets of equality units, the resulting system is ve...
متن کاملA Many-Sorted Calculus Based on Resolution and Paramodulation
The f i rst-order calculus whose well formed formulas are clauses and whose sole inference rules are factor izat ion, resolution and paramodulation is extended to a many-sorted calculus. As a basis for Automated Theorem Proving, this many-sorted calculus leads to a remarkable reduction of the search space and also to simpler proofs. The soundness and completeness of the new calculus and the Sor...
متن کاملEquality Reasoning in Clause Graphics
A method to control the application of equality derivation rules in an automatic theorem proving system is presented. When handling equality in the search for a proof of a theorem two main problems arise: 1) to obtain a control mechanism for the search and application of useful equality derivation steps in order to support global strategies which plan and control the whole proof, thus conducing...
متن کاملAutomatic Decidability: A Schematic Calculus for Theories with Counting Operators
Many verification problems can be reduced to a satisfiability problem modulo theories. For building satisfiability procedures the rewriting-based approach uses a general calculus for equational reasoning named paramodulation. Schematic paramodulation, in turn, provides means to reason on the derivations computed by paramodulation. Until now, schematic paramodulation was only studied for standar...
متن کاملLeo Bachmair and Harald Ganzinger Equational Reasoning in Saturation-based Theorem Proving
Equational reasoning is fundamental in mathematics, logics, and many applications of formal methods in computer science. In this chapter we describe the theoretical concepts and results that form the basis of state-of-the-art automated theorem provers for first-order clause logic with equality. We mainly concentrate on refinements of paramodulation, such as the superposition calculus, that have...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001